package com.singzi.leetcode.N1400;

public class T1332 {
}
class Solution1332 {
    public int removePalindromeSub(String s) {

        int count = 0;
        return count;
    }
    public boolean isPalindrome(String s){
        int i = 0;
        int j = s.length()-1;
        while (i<j){
            if(s.charAt(i) != s.charAt(j)) return false;
            i++;
            j--;
        }
        return true;
    }
}